Computing abstract decorations of parse forests using dynamic programming and algebraic power series
نویسندگان
چکیده
منابع مشابه
ALGEBRAIC INDEPENENCE OF CERTAIN FORMAL POWER SERIES (II)
We shall extend the results of [5] and prove that if f = Z o a x ? Z [[X]] is algebraic over Q (x), where a = 1, ƒ 1 and if ? , ? ,..., ? are p-adic integers, then 1 ? , ? ,..., ? are linkarly independent over Q if and only if (1+x) ,(1+x) ,…,(1+x) are algebraically independent over Q (x) if and only if f , f ,.., f are algebraically independent over Q (x)
متن کاملALGEBRAIC INDEPENDENCE OF CERTAIN FORMAL POWER SERIES (I)
We give a proof of the generalisation of Mendes-France and Van der Poorten's recent result over an arbitrary field of positive characteristic and then by extending a result of Carlitz, we shall introduce a class of algebraically independent series.
متن کاملSemiring Parsing
decorations of parse forests usingdynamic programming and algebraicpower series. Theoretical Computer Science.To appear.Tendeau, Frédéric. 1997b. An Earleyalgorithm for generic attribute augmentedgrammars and applications. In Proceedingsof the International Workshop on ParsingTechnologies 1997, pages 199–209.Viterbi, Andrew J. 1967. Error bounds forconvol...
متن کاملEffective Algebraic Power Series
The division algorithm for ideals of algebraic power series satisfying Hironaka’s box condition is shown to be finite when expressed suitably in terms of the defining polynomial codes of the series.
متن کاملEncoding Algebraic Power Series
The division algorithm for ideals of algebraic power series satisfying Hironaka’s box condition is shown to be finite when expressed suitably in terms of the defining polynomial codes of the series. In particular, the codes of the reduced standard basis of the ideal can be constructed effectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00271-5